Inducing Decision Trees via Concept Lattices

نویسندگان

  • Radim Belohlávek
  • Bernard De Baets
  • Jan Outrata
  • Vilém Vychodil
چکیده

The paper presents a new method of decision tree induction based on formal concept analysis (FCA). The decision tree is derived using a concept lattice, i.e. a hierarchy of clusters provided by FCA. The idea behind is to look at a concept lattice as a collection of overlapping trees. The main purpose of the paper is to explore the possibility of using FCA in the problem of decision tree induction. We present our method and provide comparisons with selected methods of decision tree induction on testing datasets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extracting Decision Trees from Interval Pattern Concept Lattices

Formal Concept Analysis (FCA) and concept lattices have shown their effectiveness for binary clustering and concept learning. Moreover, several links between FCA and unsupervised data mining tasks such as itemset mining and association rules extraction have been emphasized. Several works also studied FCA in a supervised framework, showing that popular machine learning tools such as decision tre...

متن کامل

Some Links Between Decision Tree and Dichotomic Lattice

There are two types of classification methods using a Galois lattice: as most of them rely on selection, recent research work focus on navigationbased approaches. In navigation-oriented methods, classification is performed by navigating through the complete lattice, similar to the decision tree. When defined from binary attributes obtained after a discretization pre-processing step, and more ge...

متن کامل

IGLUE: An Instance-Based Learning System over Lattice Theory

Concept learning is one of the most studied areas in machine learning. A lot of work in this domain deals with decision trees. In this paper, we are concerned with a diierent kind of technique based on Galois lattices or concept lattices. We present a new semi-lattice based system, IGLUE, that uses the entropy function with a top-down approach to select concepts during the lattice construction....

متن کامل

Characterizing trees in property-oriented concept lattices

Property-oriented concept lattices are systems of conceptual clusters called property-oriented concepts, which are partially ordered by the subconcept/superconcept relationships. Property-oriented concept lattices are basic structures used in formal concept analysis. In general, a property-oriented concept lattice may contain overlapping clusters and is not to be a tree construction. Additional...

متن کامل

Parent Selection Criterion for Extracting Trees from Concept Lattices

Traditional software in Formal Concept Analysis makes little use of visualization techniques, producing poorly readable concept lattice representations when the number of concepts exceeds a few dozens. This is problematic as the number of concepts in such lattices grows significantly with the size of the data and the number of its dimensions. In this work we propose several methods to enhance t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. General Systems

دوره 38  شماره 

صفحات  -

تاریخ انتشار 2007